On the Average Height of b-Balanced Ordered Trees

نویسنده

  • Rainer Kemp
چکیده

An ordered tree with height h is b-balanced if all its leaves have a level ` with h − b ≤ ` ≤ h, where at least one leaf has a level equal to h− b. For large n, we shall compute asymptotic equivalents to the number of all b-balanced ordered trees with n nodes and of all such trees with height h. Furthermore, assuming that all b-balanced ordered trees with n nodes are equally likely, we shall determine the exact asymptotic behaviour of the average height of such a tree together with the variance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Average Height of b-Balanced Ordered Trees

An ordered tree with height h is b-balanced if all its leaves have a level l with h − b <= l <= h, where at least one leaf has a level equal to h − b. For large n, we shall compute asymptotic equivalents to the number of all b-balanced ordered trees with n nodes and of all such trees with height h. Furthermore, assuming that all b-balanced ordered trees with n nodes are equally likely, we shall...

متن کامل

The effect of ecophysiography on the quantitative characteristics of DBH, height, basal area, crown diameter and canopy area of trees in mountain forest communities (Case study: Oak-hornbeam community in Arasbaran forest)

Ecophysiography is the geography of the earth and the relationship between physiography and the ecosystem. Ecophysiography is a basis for planning processes to study the characteristics of terrestrial systems concerning the interactions between terrestrial physiography and living organisms. Due to the current state of ecosystems and the increase in natural disasters for ecosystem sustainability...

متن کامل

0 Rank - Balanced Trees

Since the invention of AVL trees in 1962, many kinds of binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing after an insertion or deletion takes O(1) amortized time and O(1) rotations worst-case. But the design space of balanced trees has not been fully explored. We continue the exploration. Our contributions are three. We systematically study the...

متن کامل

بررسی ویژگی های ریخت شناسی درختان کهنسال در جنگل های زاگرس (مطالعه موردی: جنگل های استان ایلام)

This study was conducted in oak forests of Ilam province in order to evaluate the morphological characteristics of old trees including diameter at breast height, trunk height, whole tree height, minimum and maximum crown diameter, crown health, crown vitality, crown symmetry, health and form of the trunk, Was investigated. Selection of old trees was performed based on the criteria of DBH and wi...

متن کامل

Smoothed Analysis of the Height of Binary Search Trees

Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform distribution is only logarithmic. The exact value is one of the best studied problems in average case complexity. We investigate what happens in between by analysing the smoothed height of binary search trees: random...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006